Randomized Algorithm for Scaling Factors in Fractal Image Compression
نویسندگان
چکیده
منابع مشابه
Randomized Algorithm for Scaling Factors in Fractal Image Compression
Modern fractal compression methods are based on iterative function systems (IFS), which was developed by Barnsley [1] and Jacquin [2]. During compression, the algorithm partitions the image into a set of square blocks (domain blocks). After this a new partition is made into smaller range blocks [2]. The domain blocks are generally double the size of range blocks. For every range block the neare...
متن کاملAlgorithm for Fast Fractal Image Compression
Fractal image compression is a promising new technology that may successfully provide a codec for PC-to-PC video communications. Unfortunately, the large amount of computation needed for the compression stage is a major obstacle that needs to be overcome. This paper introduces the Fast Fractal Image Compression algorithm, a new approach to breaking the “speed problem” that has plagued previous ...
متن کاملGenetic Algorithm Applied to Fractal Image Compression
In this paper the technique of Genetic Algorithm (GA) is applied for Fractal Image Compression (FIC). With the help of this evolutionary algorithm effort is made to reduce the search complexity of matching between range block and domain block. One of the image compression techniques in the spatial domain is Fractal Image Compression but the main drawback of FIC is that it involves more computat...
متن کاملGenetic Algorithm based Fractal Image Compression
Fractal Image Compression is a lossy compression technique that has been developed in the early 1990s. Fractal image compression explores the self-similarity property of a natural image and utilizes the partitioned iterated function system (PIFS) to encode it. The fractal image compression problem had three major requirements: speeding up the compression algorithm, improving image quality and i...
متن کاملA New Fractal Hyperspectral Image Compression Algorithm
Because of the great data of the hyperspectral image, it is not good for storage and transmission. To work out a high efficiency compression method for hyperspectral image is essential. Prediction encoding is easy to realize and has been studied widely in the hyperspectral image compression field. High compression ratio, resolution independence and fast decoding speed are the main advantages of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/5553-7624